Enhancing Query-oriented Summarization based on Sentence Wikification
نویسندگان
چکیده
Query-oriented summarization is primarily concerned with synthesizing an informative and well-organized summary from a document collection for a given query. In the existing summarization methods, each individual sentence in the document collection is represented as Bag of Words (BOW). In this paper, we propose a novel framework which improves query-oriented summarization via sentence wikification, i.e., enriching sentence representation with Wikipedia concepts. Furthermore, we exploit semantic relatedness of Wikipedia concepts as a smoothing factor in sentence wikification. The experiments with benchmark dataset show that sentence wikification performs effectively for improving query-oriented summarization, and helps to generate more high-quality summaries.
منابع مشابه
WikiSummarizer - A Wikipedia-based Summarization System
This paper presents our WikiSummarizer system at the guided summarization track of TAC 2010. This system is derived from a novel framework which improves summarization through sentence wikification, i.e., enriching sentence representation with concepts from Wikipedia. By examining sentences in the feature space of Wikipedia concepts, we are able to obtain sentence similarity which is more consi...
متن کاملSemi-Supervised Co-Clustering for Query-Oriented Theme-based Summarization
Sentence clustering plays an important role in theme-based summarization which aims to discover the topical themes defined as the clusters of highly related sentences. However, due to the short length of sentences, the word-vector cosine similarity traditionally used for document clustering is no longer suitable. To alleviate this problem, we regard a word as an independent text object rather t...
متن کاملOn the Effectiveness of using Sentence Compression Models for Query-Focused Multi-Document Summarization
This paper applies sentence compression models for the task of query-focused multi-document summarization in order to investigate if sentence compression improves the overall summarization performance. Both compression and summarization are considered as global optimization problems and solved using integer linear programming (ILP). Three different models are built depending on the order in whi...
متن کاملPNR2: Ranking Sentences with Positive and Negative Reinforcement for Query-Oriented Update Summarization
Query-oriented update summarization is an emerging summarization task very recently. It brings new challenges to the sentence ranking algorithms that require not only to locate the important and query-relevant information, but also to capture the new information when document collections evolve. In this paper, we propose a novel graph based sentence ranking algorithm, namely PNR, for update sum...
متن کاملA Cluster-Sensitive Graph Model for Query-Oriented Multi-document Summarization
In this paper, we develop a novel cluster-sensitive graph model for query-oriented multi-document summarization. Upon it, an iterative algorithm, namely QoCsR, is built. As there is existence of natural clusters in the graph in the case that a document comprises a collection of sentences, we suggest distinguishing intraand inter-document sentence relations in order to take into consideration th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010